Search results

The purpose of this paper is to study the unit train make-up scheme for loaded direction in the heavy haul railway.

A 0-1 nonlinear integer programming model with the aim of minimizing the idling period between actual train arrival time and expected train arrival time for all loaded unit trains are proposed.

The proposed model is applied into a case study based on Daqin heavy haul railway. Results show that the proposed model can offer operators an optimal unit train make-up scheme for loaded direction in heavy haul railway.

The proposed model can offer operators an optimal unit train make-up scheme for loaded direction in heavy haul railway.

Advanced manufacturing machines (AMMs) are searched as a momentous asset across the manufacturing societies for quenching and addressing the production units under economical circumstances, i.e. production of high-quality of goods under feasible cost. AMMs are significant in holding the managers against their rivals and competitors with high profit margins. The authors developed the decision support mechanism/portfolio (DSM-P) consist of knowledge-based cluster approach with a dynamic model. The purpose of research work is to measure overall economic worth of AMMs under objective and grey-imperfect (mixed) data by exploring the proposed DSM-P.

The authors developed the DSM-P that consist of knowledge-based cluster, three multi-criteria decision-making (MCDM) techniques-1-2-3 with complementary grey relational analysis-4(GRA), approach with a dynamic model (complied by technical plus cost and agility measures of AMMs). The proposed DSM-P enables the manager to map the overall economic worth of candidate AMMs under objective and grey-mixed data.

The presented DSM-P assist the managers for handling the selection problem of AMMs, i.e. CNCs, robots, automatic-guided vehicle, etc under mixed (objective cum grey) data. To enable the readers for intensely understand the work, the utility of proposed approach is displayed by illustrating a polar robot evaluation and selection problem. It is ascertained that the robot candidate-11 alternative is fulfilling the entire technical cum cost and agility measures.

The DSM-P provides more precise and reliable outcomes due to a usage of the dominance theory. Under the dominance theory, the ranks are obtained by MCDM techniques-1-2-3 are compared with ranks gathered by the GRA-4 under objective cum grey data, formed the novelties in presented research work. From a future perspective, the grey-based models in DSM-P can be built/extended/constructed more extensive and can be simulated by the same approach.

The purpose of this paper is to understand the drivers that create complexity in the supply chain and develop a mathematical model to measure the level of supply chain complexity (SCC).

Through extensive literature review, the authors discussed various drivers of SCC. These drivers were classified into five dimensions based on expert opinion. Moreover, a novel hybrid mathematical model was developed by integrating analytical hierarchy process (AHP) and grey relational analysis (GRA) methods to measure the level of SCC. A case study was conducted to demonstrate the applicability of the developed model and analyze the SCC level of the company in the study.

The authors identified 22 drivers of SCC, which were further clustered into five complexity dimensions. The application of the developed model to the company in the case study showed that the SCC level of the company was 0.44, signifying that there was a considerable scope of improvement in terms of minimizing complexity. The company that serves as the focus of this case study mainly needs improvement in tackling issues concerning government regulation, internal communication and information sharing and company culture.

In this paper, the authors propose a model by integrating AHP and GRA methods that can measure the SCC level based on various complexity drivers. The combination of such methods, considering their ability to convert the inheritance and interdependence of drivers into a single mathematical model, is preferred over other techniques. To the best of the authors' knowledge, this is the first attempt at developing a hybrid multicriteria decision-based model to quantify SCC.

A set of routers that are connected over communication channels can from network-on-chip (NoC). High performance, scalability, modularity and the ability to parallel the structure of the communications are some of its advantages. Because of the growing number of cores of NoC, their arrangement has got more valuable. The mapping action is done based on assigning different functional units to different nodes on the NoC, and the way it is done contains a significant effect on implementation and network power utilization. The NoC mapping issue is one of the NP-hard problems. Therefore, for achieving optimal or near-optimal answers, meta-heuristic algorithms are the perfect choices. The purpose of this paper is to design a novel procedure for mapping process cores for reducing communication delays and cost parameters. A multi-objective particle swarm optimization algorithm standing on crowding distance (MOPSO-CD) has been used for this purpose.

In the proposed approach, in which the two-dimensional mesh topology has been used as base construction, the mapping operation is divided into two stages as follows: allocating the tasks to suitable cores of intellectual property; and plotting the map of these cores in a specific tile on the platform of NoC.

The proposed method has dramatically improved the related problems and limitations of meta-heuristic algorithms. This algorithm performs better than the particle swarm optimization (PSO) and genetic algorithm in convergence to the Pareto, producing a proficiently divided collection of solving ways and the computational time. The results of the simulation also show that the delay parameter of the proposed method is 1.1 per cent better than the genetic algorithm and 0.5 per cent better than the PSO algorithm. Also, in the communication cost parameter, the proposed method has 2.7 per cent better action than a genetic algorithm and 0.16 per cent better action than the PSO algorithm.

As yet, the MOPSO-CD algorithm has not been used for solving the task mapping issue in the NoC.